Necklace Bisection with One Cut Less than Needed
نویسندگان
چکیده
منابع مشابه
Necklace Bisection with One Cut Less than Needed
A well-known theorem of Goldberg and West states that two thieves can always split a necklace containing an even number of beads from each of k types fairly by at most k cuts. We prove that if we can use at most k− 1 cuts and fair splitting is not possible then the thieves still have the following option. Whatever way they specify two disjoint sets D1, D2 of the types of beads with D1 ∪ D2 6= ∅...
متن کاملNonlinear optics with less than one photon.
We demonstrate suppression and enhancement of spontaneous parametric down-conversion via quantum interference with two weak fields from a local oscillator (LO). Effectively, pairs of LO photons up-convert with high efficiency for appropriate phase settings, exhibiting an effective nonlinearity enhanced by at least 10 orders of magnitude. This constitutes a two-photon switch and promises to be a...
متن کاملEating motives and the controversy over dieting: eating less than needed versus less than wanted.
Anti-dieting sentiment has grown in recent years. Critics of restrained eating suggest that it evokes counter-regulatory responses that render it ineffective or even iatrogenic. However, restrained eaters are not in negative energy balance and overweight individuals show reduced eating problems when losing weight by dieting. A distinction is often drawn between physiological and psychological h...
متن کاملSaying More (or Less) than One Thing
In a paper called Definiteness and Knowability, Timothy Williamson investigates the question of whether one must accept that vagueness is an epistemic phenomenon if one adopts classical logic and a disquotational principle for truth. Some have thought that one must not, and have argued that classical logic and the disquotational principle can be preserved without accepting that vagueness is an ...
متن کاملBetween Min Cut and Graph Bisection between Min Cut and Graph Bisection
We investigate a class of graph partitioning problems whose two extreme representatives are the well-known Min Cut and Graph Bisection problems. The former is known to be eeciently solvable by ow techniques, the latter to be NP-complete. The results presented in this paper are { a monotony result of the type \The more balanced the partition we look for has to be, the harder the problem". { a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/891